An Algorithm for the Bipartite Linear Distance Traveling Tournament Problem
نویسنده
چکیده
I apply a linear distance heuristic to the n-team Bipartite Traveling Tournament problem, which treats the problem as if the n teams are located on a straight line, reducing the number of variables. I then generate an algorithm to solve this variation of the problem. I then compare the results of my algorithm with results presented in previous papers. My algorithm does not present an optimal solution to the problem, but does provide a good starting point and generates a solution very quickly.
منابع مشابه
Scheduling Bipartite Tournaments to Minimize Total Travel Distance
In many professional sports leagues, teams from opposing leagues/conferences compete against one another, playing inter-league games. This is an example of a bipartite tournament. In this paper, we consider the problem of reducing the total travel distance of bipartite tournaments, by analyzing inter-league scheduling from the perspective of discrete optimization. This research has natural appl...
متن کاملThe Inter-League Extension of the Traveling Tournament Problem and its Application to Sports Scheduling
With the recent inclusion of inter-league games to professional sports leagues, a natural question is to determine the “best possible” inter-league schedule that retains all of the league’s scheduling constraints to ensure competitive balance and fairness, while minimizing the total travel distance for both economic and environmental efficiency. To answer that question, this paper introduces th...
متن کاملGenerating Approximate Solutions to the TTP using a Linear Distance Relaxation
In some domestic professional sports leagues, the home stadiums are located in cities connected by a common train line running in one direction. For these instances, we can incorporate this geographical information to determine optimal or nearly-optimal solutions to the n-team Traveling Tournament Problem (TTP), an NP-hard sports scheduling problem whose solution is a double round-robin tournam...
متن کاملAn Effective Genetic Algorithm for Solving the Multiple Traveling Salesman Problem
The multiple traveling salesman problem (MTSP) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. The objective is to minimize the total distance traveled by all the salesmen. The MTSP is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. In this paper,...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کامل